A second deduction theorem for rejection theses in Ł ukasiewicz's system of modal logic.
نویسندگان
چکیده
منابع مشابه
Does the deduction theorem fail for modal logic?
Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic ...
متن کاملModal Deduction in Second-Order Logic and Set Theory - I
In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in 11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We rst extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable c...
متن کاملModal Deduction in Second-Order Logic and Set Theory - II
In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in 11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, deening a new set-theoretic function symbol for each new modal operator, we develop a general framework within which a number of extended modal logics can be dealt with. More precisely, we extend the basic set...
متن کاملHerbrand’s Theorem for a Modal Logic
ion X → X ′ 〈λx.X〉(t)→ 〈λx.X ′〉(t) +Lambda ¬X → ¬X ′ ¬〈λx.X〉(t)→ ¬〈λx.X ′〉(t) −Lambda Quantification For new variables x1, . . . , xn, ¬φ(x)→ ¬φ1(x) . . . ¬φ(x)→ ¬φn(x) ¬(∀x)φ(x)→ ¬[φ1(x1) ∧ . . . ∧ φn(xn)] −Quant Binding For x not free in X, X → X ′ X → 〈λx.X ′〉(t) +Bind ¬X → ¬X ′ ¬X → ¬〈λx.X ′〉(t) −Bind Definition 5.2 We say Y is a modal Herbrand expansion of X provided there is a formula X∗ ...
متن کاملA Lindstrom theorem for modal logic
A modal analogue of Lindstrr om's characterization of rst-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of nite rank, or, equivalently, as the strongest modal logic whose formulas are preserved under ultra-products over !. Also, basic modal logic is the strongest classical logic whose formulas are preserved under bisimulations and ultra-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1979
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093882659